JOB SEARCH AND ASSET ACCUMULATION UNDER BORROWING CONSTRAINTS*
نویسندگان
چکیده
منابع مشابه
Flexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملAsset Prices Under Short-Sale Constraints
In this paper, we study how short-sale constraints affect asset price and market efficiency. We consider a fully rational expectations equilibrium model, in which investors trade for two reasons, to share risk and to speculate on private information, but they face short-sale constraints. Short-sale constraints limit both types of trades, and thus reduce the allocational and informational effici...
متن کاملMinimizing the Probability of Lifetime Ruin under Borrowing Constraints
We determine the optimal investment strategy of an individual who targets a given rate of consumption and who seeks to minimize the probability of going bankrupt before she dies, also known as lifetime ruin. We impose two types of borrowing constraints: First, we do not allow the individual to borrow money to invest in the risky asset nor to sell the risky asset short. However, the latter is no...
متن کاملAn Analytical Approach to Buffer-Stock Saving under Borrowing Constraints
The profession has been longing for closed-form solutions to consumption functions under uncertainty and borrowing constraints. This paper proposes an analytical approach to solving general-equilibrium bu¤er-stock saving models with both idiosyncratic and aggregate uncertainties as well as liquidity constraints. It is shown analytically that an individuals optimal consumption plan follows the ...
متن کاملflexible job shop scheduling under availability constraints
in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Economic Review
سال: 2006
ISSN: 0020-6598,1468-2354
DOI: 10.1111/j.1468-2354.2006.00378.x